Biography

I am a final year PhD student in Electrical and Computer Engineering department at Carnegie Mellon University, where I am fortunate to have Elaine Shi as my advsior. Previously, I received MS in Information Security in 2021 from Carnegie Mellon University where I was also advised by Elaine. Even before, I received B.Tech. in Computer Science and Engineering in 2018 from IIT Kanpur.

My research interests are in Cryptography and Blockchains. I develop new techniques for functional encryption and explores its applications to decentralized systems, with the goal of making advanced cryptographic tools practical for real-world use. My work so far builds (i) new functional encryption schemes that are both efficient and provably secure, and (ii) applications of functional encryption to decentralized access control, fair exchange and anonymous communication. Ultimately, I aim to design expressive, efficient, and privacy-preserving systems that bridge the gap between provable security and real-world deployment.

You can find my CV here. Contact: nikhilvanjani61 [at] gmail.com.

NEWS

  • Our work on broadening functionality and improving efficiency of Functional Adaptor Signatures got accepted to S&P (Oakland)‘26
  • Our work on showing fully adaptive security of the classic Lewko-Waters MA-ABE got accepted to Asiacrypt'25
  • Research Internship at NTT Research during Summer'25
  • Research Internship at 0xPARC Foundation during Spring'25
  • Our work on enabling functional fair exchange via Functional Adaptor Signatures got accepted to CCS'24
  • Research Internship at NTT Research during Summer'24

Publications

*: denotes first author

New Constructions of Functional Adaptor Signatures : Broader Functions and Improved Efficiency.

(To Appear) In IEEE Symposium on Security and Privacy, 2026.
Fully Adaptive Decentralized MA-ABE: Simplified, Optimized, ASP Supported.

(To Appear) In Asiacrypt, 2025.
Functional Adaptor Signatures: Beyond All-or-Nothing Blockchain-based Payments.

In ACM SIGSAC Conference on Computer and Communications Security (CCS), 2024.
Contributed talk at Theory and Practice of Multi-Party Computation (TPMPC) Workshop, 2025.
Non-Interactive Anonymous Router with Quasi-Linear Router Computation.

In Theory of Cryptography Conference (TCC), 2023.
Multi-Client Inner Product Encryption: Function-Hiding Instantiations Without Random Oracles.

In International Conference on Practice and Theory of Public-Key Cryptography (PKC), 2023.

Talks

Fully Adaptive Decentralized MA-ABE: Simplified, Optimized, ASP Supported. Slides Video
Stanford Security Seminar: October 2025
NTT Research CIS Seminar: October 2025
CMU Crypto Seminar: September 2025
Fair Exchange on Blockchains. Slides
Invited Lecture at University of Utah: October 2024
Non-Interactive Anonymous Router with Quasi-Linear Router Computation. Slides Video
IACR TCC: December 2023
Ph.D. Qualifying Exam, CMU : November 2022
Obfuscation of Probabilistic Circuits and Applications. Slides
Course Project for Computing on Encrypted Data, IITM : November 2019
Two case studies on advances in Blockchains: Algorand, Zcash. Slides
Seminar Talk for National Blockchain Project, IITK : April 2018
Fully Homomorphic Encryption. Slides
Course Project for Linear Algebra Tools for Theoretical CS, IITK : April 2018
On Lattices, Learning With Errors, Random Linear Codes, and Cryptography. Slides
Course Project for Quantum Computing, IITK : October 2017

Research Experience

 
 
 
 
 
NTT Research
Research Intern
NTT Research
Jun 2025 – Aug 2025 Sunnyvale
Pioneered new attribute-based encryption schemes that expanded functionality and significantly improved efficiency, advancing the practicality of lattice-based cryptography
 
 
 
 
 
0xPARC Foundation
Research Intern
0xPARC Foundation
Mar 2025 – May 2025 Pittsburgh
Benchmarked modern zero-knowledge proof systems (Plonky2/Plonky3), providing performance insights to guide practical adoption of advanced cryptographic protocols
 
 
 
 
 
NTT Research
Research Intern
NTT Research
Jun 2024 – Aug 2024 Sunnyvale
Developed foundational advances in multi-authority attribute-based encryption by proving full adaptive security for the classic Lewko–Waters scheme and designing the first scheme for Arithmetic Span Programs
 
 
 
 
 
Theory Group, Algorand
Intern - Smart Contracts Researcher
Theory Group, Algorand
May 2021 – Aug 2021 Pittsburgh
Investigated cryptographic tools needed to enable building complex and powerful Layer 2 Smart Contracts in AlgoClarity (Algorand’s version of the Clarity Smart Contract Language).
 
 
 
 
 
Cryptography Group, IIT Madras
Research Assistant
Cryptography Group, IIT Madras
Aug 2019 – Jun 2020 Chennai
Designed a blockchain-based voting system with support for vote verification to enable voters to vote from anywhere with the goal of increasing voter turnout.